Structural Symmetry Breaking for Constraint Satisfaction Problems
نویسندگان
چکیده
In recent years, symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various forms of value or variable interchangeability is tractable using dedicated search procedures. We also show the limits of efficient symmetry breaking for such dominance-detection schemes by proving intractability results for some classes of CSPs.
منابع مشابه
Efficient Structural Symmetry Breaking for Constraint Satisfaction Problems
Symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various ...
متن کاملStructural Symmetry Breaking
Symmetry breaking has been shown to be an important method to speed up the search in constraint satisfaction problems that contain symmetry. When breaking symmetry by dominance detection, a computationally efficient symmetry breaking scheme can be achieved if we can solve the dominance detection problem in polynomial time. We study the complexity of dominance detection when value and variable s...
متن کاملAn Empirical Study of Structural Symmetry Breaking
We present an empirical comparison between dynamic and static methods for structural symmetry breaking (SSB). SSB was recently introduced as the first method for breaking all piecewise value and variable symmetries in a constraint satisfaction problem. So far it is unclear which of the two techniques is better suited for piecewise symmetric CSPs, and this study presents results from the first e...
متن کاملAn approach to Symmetry Breaking in Distributed Constraint Satisfaction Problems
Symmetry breaking in Distributed Constraint Satisfaction Problems (DisCSPs) has, to the best of our knowledge, not been investigated. In this paper, we show that most symmetries in DisCSPs are actually weak symmetries, and we demonstrate howweak symmetry breaking techniques can be applied to DisCSPs.
متن کاملGeneral Symmetry Breaking Constraints
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simultaneously on variables and values, conditional symmetries, as well as symmeties acting on set and other types of variables.
متن کامل